Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting
نویسندگان
چکیده
منابع مشابه
Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting
It is well known that the complexity of Gröbner bases computation strongly depends on the term ordering, moreover, elimination orderings often yield a greater complexity. This remark led to the so-called FGLM conversion problem, i.e. given a Gröbner basis w.r.t. a certain term ordering,‖ find a Gröbner basis of the same ideal w.r.t. another term ordering. One of the efficient approaches for sol...
متن کاملComputing Grr Obner Bases by Fglm Techniques in a Noncommutative Setting
A generalization of the FGLM technique is given to compute Grr obner bases for two-sided ideals of free nitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) presentations. Generalizations are discussed in order to compute G-bases on (twisted) semigroup rings. It is well known that the co...
متن کاملComputing inhomogeneous Gröbner bases
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Gröbner bases via Buchberger’s Algorithm. In a nutshell, the idea is to extend the advantages of computing with homogeneous polynomials or vectors to the general case. When the input data are not homogeneous, we use a technique described in Section 2: the main tool ...
متن کاملProperties of Commutative Association Schemes Derived by Fglm Techniques
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition designs etc. In this paper we show some techniques for computing properties of association schemes. The main framework arises from the fact that we can char...
متن کاملFGb: A Library for Computing Gröbner Bases
FGb is a high-performance, portable, C library for computing Gröbner bases over the integers and over finite fields. FGb provides high quality implementations of state-of-the-art algorithms (F4 and F5) for computing Gröbner bases. Currently, it is one of the best implementation of these algorithms, in terms of both speed and robustness. For instance, FGb has been used to break several cryptosys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0415